Even Sequential Harmonious Labeling On Path and Cycle Related Graphs
نویسندگان
چکیده
In this paper, we have shown that collection of paths P i n where n is odd, cycle, triangular snake, quadrilateral snake, P 2 n are even sequential harmonious graph and also we prove that the cycle Cn be a cycle u1, u2, · · · , un is an even sequential harmonious graph. Let G be a graph with V (G) = V (Cn) ∪ {wi : 1 ≤ i ≤ n}, E(G) = E(Cn) ∪ {uiwiui−1wi : 1 ≤ i ≤ n}, then G is an even sequential harmonious graph. Let Cn be a cycle u1, u2, · · · , un. Let G be a graph with V (G) = V (Cn) and E(G) = E(Cn)∪{u2un}, then G is an even sequential harmonious graph and finally, we have shown that the crown Cn K1 is an even sequential harmonious graph. Mathematics Subject classification: 05C78 4724 P. Selvaraju et al.
منابع مشابه
3-difference cordial labeling of some cycle related graphs
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
متن کاملRemainder Cordial Labeling of Graphs
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملOn Harmonious Labelings of Some Cycle Related Graphs
A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G)→ {0, 1, 2, · · · , 2q − 1} such that the induced function f∗ : E(G) → {1, 3, · · · , 2q − 1} defined by f∗(uv) = f(u) + f(v) is a bijection. A graph that admits odd harmonious labeling is called odd harmonious graph. In this paper we prove that any two even cycles sharing a common vertex and a common edge are od...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کامل